Sequences of irreducible polynomials without prescribed coefficients over odd prime fields
نویسندگان
چکیده
منابع مشابه
Irreducible Polynomials over GF(2) with Three Prescribed Coefficients
For an odd positive integer n, we determine formulas for the number of irreducible polynomials of degree n over GF (2) in which the coefficients of xn−1, xn−2 and xn−3 are specified in advance. Formulas for the number of elements in GF (2n) with the first three traces specified are also given. Let q be a prime power and let GF (q) be a finite field with q elements. A classical result (see [6, 3...
متن کاملIrreducible polynomials with several prescribed coefficients
We study the number of monic irreducible polynomials of degree n over Fq having certain preassigned coefficients, where we assume that the constant term (if preassigned) is nonzero. Hansen and Mullen conjectured that for n ≥ 3, one can always find an irreducible polynomial with any one coefficient preassigned (regardless of the ground field Fq). Their conjecture was established in all but finit...
متن کاملConstructing Irreducible Polynomials with Prescribed Level Curves over Finite Fields
We use Eisenstein’s irreducibility criterion to prove that there exists an absolutely irreducible polynomial P(X,Y) ∈ GF(q)[X,Y] with coefficients in the finite field GF(q) with q elements, with prescribed level curves Xc := {(x,y)∈GF(q)2 | P(x,y)= c}. 2000 Mathematics Subject Classification. 11T06.
متن کاملIrreducible Polynomials over Finite Fields
As we will see, modular arithmetic aids in testing the irreducibility of polynomials and even in completely factoring polynomials in Z[x]. If we expect a polynomial f(x) is irreducible, for example, it is not unreasonable to try to find a prime p such that f(x) is irreducible modulo p. If we can find such a prime p and p does not divide the leading coefficient of f(x), then f(x) is irreducible ...
متن کاملNumber of irreducible polynomials and pairs of relatively prime polynomials in several variables over finite fields
We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the total degree and the vector degree, are considered. We show that the number of irreducibles can be computed recursively by degree and that the number of relatively prime pairs can be ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2013
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-013-9897-1